Sloane's box stacking problem
نویسندگان
چکیده
منابع مشابه
Sloane's box stacking problem
Recently, Sloane suggested the following problem: We are given n boxes, labeled 1, 2, . . . , n. For i = 1, . . . , n, box i weighs (m − 1)i grams (where m ≥ 2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior to this generalized pr...
متن کاملUsing Genetic Algorithms to Solve the Box Stacking Problem
The box stacking or strip stacking problem is exceedingly difficult to solve using conventional methods due to the size of the solution space. An alternative to conventional methods is to use a genetic algorithm. Genetic algorithms search the solution space using the concepts of evolution. The core of the problem relies on how the boxes are stacked. In this problem, a left to right bottom up mi...
متن کاملHeuristic-based Model for Container Stacking Problem
The paper presents a container stacking model that simulates, solves and optimizes the container stacking activity within a fluvial or maritime port. This activity constitutes a real world problem that is omnipresent in logistic and transportation domain. Given container arrivals in a container port terminal, the objective is to assign a slot to each one in a storage area at least cost with res...
متن کاملHeuristic search for the stacking problem
This paper presents the Stacking Problem, a hard combinatorial optimization problem concerning handling and storage of items in a warehouse, where they are handled by a crane and organized into stacks. We define the problem, study its complexity class, and present a mathematical programming model to solve it. In order to tackle mediumor large-scale instances, we propose a simulation-based algor...
متن کاملThe box mover problem
We show that the optimization problem is NP-hard for a wide class of motion planning puzzles, including classical SOKOBAN. We investigate a new problem, the Box Mover Problem (BMP), in which the agent is allowed to lift and carry boxes on a rectilinear grid in order to rearrange them. Some classical motion planning puzzles are special cases of BMP. We also identify a natural class of BMP instan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.051